Instability of FIFO Queueing Networks with Quick Service Times
نویسندگان
چکیده
منابع مشابه
Cyclic Queueing Networks with Subexponential Service Times
For a K-stage cyclic queueing network with N customers and general service times we provide bounds on the n departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service time distribution is subexponential.
متن کاملStability of Multiclass Queueing Networks Under FIFO Service Discipline
In this paper, we rst formally identify a FIFO uid network that corresponds to the queueing network under a rst-in rst-out (FIFO) service discipline, thus complementing the result of Dai (1995a) for the use of the uid model for the stability of a multiclass queueing network under a FIFO service discipline. Then we establish two suucient conditions for the stability of a multiclass FIFO queueing...
متن کاملTail Asymptotics of Queueing Networks with Subexponential Service Times
To myself and my parents... iii ACKNOWLEDGEMENTS Throughout my graduate studies, I am indebted to many people for their help and encouragement. First of all, I would like to thank my advisor Prof. Hayriye Ayhan. It is impossible for me to express in words my full appreciation. However, I would like to thank all of her advice and support during my graduate studies. I would not have completed thi...
متن کاملConcavity of Queueing Systems with Nbu Service Times
This paper establishes structural properties of the throughput of a large class of queueing networks with i.i.d. new-better-than-used service times. The main result obtained in this paper is applied to a wide range of networks including tandems, cycles and fork-join networks with general blocking and starvation as well as certain networks with splitting-merging of traac streams, to deduce conca...
متن کاملApproximate Analysis of Queueing Networks with Markovian Arrival Processes and Phase Type Service Times
Open queueing networks with Markovian arrival processes and phase type service times are considered. A technique is proposed for the speciication of the models. Using such a speciication, a Markov chain can be generated automatically. Furthermore, this description can be used immediately for simulation. An approximate disaggregation{aggregation technique for nite state Markov chains is applied....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 1994
ISSN: 1050-5164
DOI: 10.1214/aoap/1177004967